Range reliability in random walks

This paper introduces a definition of reliability based on a process range. Thus, process failure is defined when the range of a process first reaches a given and unacceptable level. The Mean Time To Failure (MTTF) which is denned as the mean of the first time for a range to attain a given amplitude is then calculated for an asymmetric random walk process. The probability distribution of the range is then given and the process reliability over long periods of system operations are then calculated. Applications such as the control of wings movements, stock price and exchange rates volatility (defined in terms of reliability) are also used to motivate the usefulness of range processes in reliability studies. Finally, we point out that there is necessarily a relationship between the range reliability and the propensity of a series to become chaotic.     

Stability and convergence of modified Ishikawa iterative sequences with errors in Banach spaces

Summary Some stability and convergence theorems of the modified Ishikawa iterative sequences with errors for asymptotically nonexpansive mapping in the intermediate sense and asymptotically pseudo contractive and uniformly Lipschitzian mappings in Banach spaces are obtained.     

两类记录值之和的中心极限定理

该文给出了Ｌｏｇｉｓｔｉｃ分布纪录值序列部分和的中心极限定理；对于Ｐａｒｅｔｏ分布纪录值序列的部分和T_n，获得了ｌｎT_n的中心极限定理．这一工作不仅具有概率论的极限理论方面的研究价值，而且在金融、保险等领域也具有相当重要的应用前景．     

Smooth Solutions to Optimal Investment Models with Stochastic Volatilities and Portfolio Constraints

   Abstract. This paper deals with an extension of Merton's optimal investment problem to a multidimensional model with stochastic volatility and portfolio constraints. The classical dynamic programming approach leads to a characterization of the value function as a viscosity solution of the highly nonlinear associated Bellman equation. A logarithmic transformation expresses the value function in terms of the solution to a semilinear parabolic equation with quadratic growth on the derivative term. Using a stochastic control representation and some approximations, we prove the existence of a smooth solution to this semilinear equation. An optimal portfolio is shown to exist, and is expressed in terms of the classical solution to this semilinear equation. This reduction is useful for studying numerical schemes for both the value function and the optimal portfolio. We illustrate our results with several examples of stochastic volatility models popular in the financial literature.     

Perfect information two-person zero-sum markov games with imprecise transition probabilities

Based on an extension of the controlled Markov set-chain model by Kurano et al. (in J Appl Prob 35:293–302, 1998) into competitive two-player game setting, we provide a model of perfect information two-person zero-sum Markov games with imprecise transition probabilities. We define an equilibrium value for the games formulated with the model in terms of a partial order and then establish the existence of an equilibrium policy pair that achieves the equilibrium value. We further analyze finite-approximation error bounds obtained from a value iteration-type algorithm and discuss some applications of the model.     

n元等比级数

定义了n元等比数列、n元等比级数,给出了它们的通项公式及前n项和.并解决了多元等比级数的敛散性问题,求出了多元等比级数的和.指出了多元等比数列及多元等比级数在特殊情况下与一元等比数列及一元等比级数的一致性.     

股票市场监管策略的一个随机模型

研究了股市在一段有可能给社会造成危害的上涨行情中，管理者监管股市的问题＋根据股市的运行规律，建立了一个随机最优化模型，讨论了参数对解的影响，并得出了一些对股市监管有意义的结论．     

广义风险过程中渐近方差的非参数估计

本文对广义风险过程中的渐近方差作了非参数估计,得出并证明了两个定理,为广义风险过程中破产概率的区间估计作了理论准备．     

Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming

In this paper, we first refine a recently proposed metaheuristic called “Marriage in Honey-Bees Optimization” (MBO) for solving combinatorial optimization problems with some modifications to formally show that MBO converges to the global optimum value. We then adapt MBO into an algorithm called “Honey-Bees Policy Iteration” (HBPI) for solving infinite horizon-discounted cost stochastic dynamic programming problems and show that HBPI also converges to the optimal value.     

Discrete-time GI/Geo/1 queue with multiple working vacations

Consider the discrete time GI/Geo/1 queue with working vacations under EAS and LAS schemes. The server takes the original work at the lower rate rather than completely stopping during the vacation period. Using the matrix-geometric solution method, we obtain the steady-state distribution of the number of customers in the system and present the stochastic decomposition property of the queue length. Furthermore, we find and verify the closed property of conditional probability for negative binomial distributions. Using such property, we obtain the specific expression for the steady-state distribution of the waiting time and explain its two conditional stochastic decomposition structures. Finally, two special models are presented.